Improved Long-Period Generators Based on Linear Recurrences
نویسندگان
چکیده
Fast uniform random number generators with extremely long periods have been defined and implemented based on linear recurrences modulo 2. The twisted GFSR and the Mersenne twister are famous recent examples. Besides the period length, the statistical quality of these generators is usually assessed via their equidistribution properties. The huge-period generators proposed so far are not quite optimal in that respect. In this paper, we propose new generators of that form, with better equidistribution and “bit-mixing” properties for equivalent period length and speed. The state of our new generators evolves in a more chaotic way than for the Mersenne twister. We illustrate how this can reduce the impact of persistent dependencies among successive output values, which can be observed in certain parts of the period of gigantic generators such as the Mersenne twister.
منابع مشابه
Combined generators with components from different families
Most random number generators used in practice are based on linear recurrences, with linear output transformations. This gives long periods, fast implementations, and structures that are easy to analyze. But the points produced by these generators have very regular structures. Nonlinear generators can have less regular structures, but they are generally slower and much harder to analyze when th...
متن کاملConstruction of Equidistributed Generators Based on Linear Recurrences Modulo 2
Random number generators based on linear recurrences modulo 2 are widely used and appear in different forms, such as the simple and combined Tausworthe generators, the GFSR, and the twisted GFSR generators. Low-discrepancy point sets for quasi-Monte Carlo integration can also be constructed based on these linear recurrences. The quality of these generators or point sets is usually measured by c...
متن کاملEfficient Jump Ahead for 2-Linear Random Number Generators
T fastest long-period random number generators currently available are based on linear recurrences modulo 2. So far, software that provides multiple disjoint streams and substreams has not been available for these generators because of the lack of efficient jump-ahead facilities. In principle, it suffices to multiply the state (a k-bit vector) by an appropriate k × k binary matrix to find the n...
متن کاملOn the Deng-Lin random number generators and related methods
We study the structure and point out weaknesses of recently-proposed random number generators based on special types of linear recurrences with small coefficients, which allow fast implementations. Our theoretical analysis is complemented by the results of simple empirical statistical tests that the generators fail decisively. Directions for improvement and alternative generators are also point...
متن کامل